Efficient Enumeration of Induced Subtrees in Undirected Graphs
نویسندگان
چکیده
In this paper, we study the enumeration problem for all induced subtrees in an input graph G. Although the subgraph version of the problem is known to be enumerable in output linear time, the induced version of the problem considered here has not been studied before and its complexity is not known so far. We first introduce the notion of the border of an induced subtree. Then, we present an enumeration algorithm for all induced subtrees in G in linear time per subtree, in which an induced subtree is obtained from another induced subtree by adding a node in the border. Finally, we present a faster algorithm that enumerates all induced subtrees in O(d) per subtree and O(n+m) space, where d is the maximum degree of G.
منابع مشابه
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph. A graph G = (V,E) is a k-degenerate graph if for any its induced subgraph has a vertex whose degree is less than or equal to k, and many real-world graphs have small degeneracies, or very close to small degeneracies. Alt...
متن کاملCMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in mining databases of trees is to find frequently occurring subtrees. However, because of the combinatorial explosion, the number of frequent subtrees usually grows exponentially with the size of the subtrees. In this paper, we p...
متن کاملBOSTER: An Efficient Algorithm for Mining Frequent Unordered Induced Subtrees
Extracting frequent subtrees from the tree structured data has important applications in Web mining. In this paper, we introduce a novel canonical form for rooted labelled unordered trees called the balanced-optimal-search canonical form (BOCF) that can handle the isomorphism problem efficiently. Using BOCF, we define a tree structure guided scheme based enumeration approach that systematically...
متن کاملIMB3-Miner: Mining Induced/Embedded Subtrees by Constraining the Level of Embedding
Tree mining has recently attracted a lot of interest in areas such as Bioinformatics, XML mining, Web mining, etc. We are mainly concerned with mining frequent induced and embedded subtrees. While more interesting patterns can be obtained when mining embedded subtrees, unfortunately mining such embedding relationships can be very costly. In this paper, we propose an efficient approach to tackle...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کامل